International standard problem on containment thermal–hydraulics ISP47

On the Containment Problem for Linear Sets

It is well known that the containment problem (as well as the equivalence problem) for semilinear sets is log-complete in Πp2. In this paper, we show that already the containment problem for linear sets is log-hard (and therefore also log-complete) in Πp2. This holds even when we use a unary encoding for the numerical input parameters or when we restrict the problem to 1-dimensional linear sets...

Transnational Crime: Its Containment through International Cooperation

Transnational crime, sometimes called international crime or multinational systemic crime, is more than an extension of domestic crime. In the context of globalization, transnational organized crime groups respond to market incentives and operate with cooperative relationships, which makes the multinational criminal systems become more efficient and powerful. As a result, no single country has ...

On the Containment Problem for Queries with Safe Negation

We consider the problem of query containment for conjunctive queries with safe negation property. A special class of queries is specified. For this class an algorithm to test the containment problem is given. The time complexity of this algorithm is presented.

International standard for haemoglobinometry.

Cost containment and the standard of medical care.